On the Complexity of Closest Pair via Polar-Pair of Point-Sets
نویسندگان
چکیده
Every graph G can be represented by a collection of equi-radii spheres in a d-dimensional metric ∆ such that there is an edge uv in G if and only if the spheres corresponding to u and v intersect. The smallest integer d such that G can be represented by a collection of spheres (all of the same radius) in ∆ is called the sphericity of G, and if the collection of spheres are non-overlapping, then the value d is called the contact-dimension of G. In this paper, we study the sphericity and contact dimension of the complete bipartite graph Kn,n in various Lp-metrics and consequently connect the complexity of the monochromatic closest pair and bichromatic closest pair problems.
منابع مشابه
Algorithms for Dynamic Closest Pair and n-Body Potential Fields
We present a general technique for dynamizing certain problems posed on point sets in Euclidean space for any xed dimension d. This technique applies to a large class of structurally similar algorithms, presented previously by the authors , that make use of the well-separated pair decomposition. We prove eecient worst-case complexity for maintaining such computations under point insertions and ...
متن کاملExistence Results of best Proximity Pairs for a Certain Class of Noncyclic Mappings in Nonreflexive Banach Spaces Polynomials
Introduction Let be a nonempty subset of a normed linear space . A self-mapping is said to be nonexpansive provided that for all . In 1965, Browder showed that every nonexpansive self-mapping defined on a nonempty, bounded, closed and convex subset of a uniformly convex Banach space , has a fixed point. In the same year, Kirk generalized this existence result by using a geometric notion of ...
متن کاملCommon fixed points for a pair of mappings in $b$-Metric spaces via digraphs and altering distance functions
In this paper, we discuss the existence and uniqueness of points of coincidence and common fixed points for a pair of self-mappings satisfying some generalized contractive type conditions in $b$-metric spaces endowed with graphs and altering distance functions. Finally, some examples are provided to justify the validity of our results.
متن کاملDiameter Approximate Best Proximity Pair in Fuzzy Normed Spaces
The main purpose of this paper is to study the approximate best proximity pair of cyclic maps and their diameter in fuzzy normed spaces defined by Bag and Samanta. First, approximate best point proximity points on fuzzy normed linear spaces are defined and four general lemmas are given regarding approximate fixed point and approximate best proximity pair of cyclic maps on fuzzy normed spaces. U...
متن کاملOn Spatial-Range Closest-Pair Query
An important query for spatial database research is to find the closest pair of objects in a given space. Existing work assumes two objects of the closest pair come from two different data sets indexed by R-trees. The closest pair in the whole space will be found via an optimzed R-tree join technique. However, this technique doesn’t perform well when the two data sets are identical. And it does...
متن کامل